About r-primitive and k-normal elements in finite fields
نویسندگان
چکیده
In 2013, Huczynska, Mullen, Panario and Thomson introduced the concept of k-normal elements: an element $$\alpha \in {\mathbb {F}}_{q^n}$$ is over $${\mathbb {F}}_q$$ if greatest common divisor polynomials $$g_{\alpha }(x)= \alpha x^{n-1}+\alpha ^qx^{n-2}+\cdots +\alpha ^{q^{n-2}}x+\alpha ^{q^{n-1}}$$ $$x^n-1$$ in {F}}_{q^n}[x]$$ has degree k, generalizing normal elements (normal usual sense 0-normal). this paper we discuss existence r-primitive {F}}_{q}$$ , where {F}}_{q^n}^*$$ its multiplicative order $$\frac{q^n-1}{r}$$ . We provide many general results about class work a numerical example finite fields characteristic 11.
منابع مشابه
Normal bases and primitive elements over finite fields
Let q be a prime power, m ≥ 2 an integer and A = ( a b c d ) ∈ GL2(Fq), where A 6= ( 1 1 0 1 ) if q = 2 and m is odd. We prove an extension of the primitive normal basis theorem and its strong version. Namely, we show that, except for an explicit small list of genuine exceptions, for every q, m and A, there exists some primitive x ∈ Fqm such that both x and (ax+b)/(cx+d) produce a normal basis ...
متن کاملOn primitive elements in finite fields of low characteristic
We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, Fqn , small q and large n, we show that the set of all low degree polynomials contains the expected number of primitive elements. The main theorem we prove is a bound for character sums over short intervals in function fields. Our result is unconditional and ...
متن کاملFinding Primitive Elements in Finite Fields of Small Characteristic
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field with p elements. In time polynomial in p and n, the algorithm either outputs an element that is provably a generator or declares that it has failed in finding one. Under a heuristic assumption, we argue that the algorithm does always succeed in finding a generator. The algorith...
متن کاملOn Finding Primitive Roots in Finite Fields
We show that in any finite field Fq a primitive root can be found in time O(q’ ‘+’ ) Let Fq denote a finite field of q elements. An element 0 E IFq is called a primitive root if it generates the multiplicative group F;,“. We show that a combination of known results on distribution primitive roots and the factorization algorithm of [6] leads to a deterministic algorithm to find a primitive root ...
متن کاملKloosterman sums and primitive elements in Galois fields
1. Introduction. Let F q denote the finite (Galois) field of order q, a power of a prime p. The multiplicative group F
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2022
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-022-01101-8